A Formulation of Mean-Field Approximation for Layered Feedforward Stochastic Networks
نویسنده
چکیده
A formulation of mean-field approximation for layered feedforward stochastic networks is presented. This formulation provides a framework to approximately treat not only averages but also correlations within each layer, so that it can be regarded as an extension to the formulation by Saul and Jordan.
منابع مشابه
Exploration of mean-field approximation for feedforward networks
We present a formulation of mean-field approximation for layered feed-forward stochastic networks. In this formulation, one can obtain not only estimates of averages for state variables of the networks but also those of intra-layer correlations, the latter of which cannot be obtained by the conventional mean-field approximation. Moreover, this formulation provides a framework to treat “conditio...
متن کاملExploration of Mean-Field Approximation for Feed-Forward Networks - Neural Networks, 1999. IJCNN '99. International Joint Conference on
We present a formulation of mean-field approximation for layered feed-forward stochastic networks. In this formulation, one can obtain not only estimates of averages for state variables of the networks but also those of intra-layer correlations, the latter of which cannot be obtained by the conventional mean-jield approximation. Moreovel; this formulation provides a pamework to treat “condition...
متن کاملAttractor Dynamics in Feedforward Neural Networks
We study the probabilistic generative models parameterized by feedforward neural networks. An attractor dynamics for probabilistic inference in these models is derived from a mean field approximation for large, layered sigmoidal networks. Fixed points of the dynamics correspond to solutions of the mean field equations, which relate the statistics of each unit to those of its Markov blanket. We ...
متن کاملCombination of Approximation and Simulation Approaches for Distribution Functions in Stochastic Networks
This paper deals with the fundamental problem of estimating the distribution function (df) of the duration of the longest path in the stochastic activity network such as PERT network. First a technique is introduced to reduce variance in Conditional Monte Carlo Sampling (CMCS). Second, based on this technique a new procedure is developed for CMCS. Third, a combined approach of simulation and ap...
متن کاملExpected Duration of Dynamic Markov PERT Networks
Abstract : In this paper , we apply the stochastic dynamic programming to approximate the mean project completion time in dynamic Markov PERT networks. It is assumed that the activity durations are independent random variables with exponential distributions, but some social and economical problems influence the mean of activity durations. It is also assumed that the social problems evolve in ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999